Resource Division Policies for EDF Scheduling in ATM Networks
نویسندگان
چکیده
The paper addresses the issue of reserving resources at ATM switches along the path of calls requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing cells using the EarliestDeadline -First (EDF) scheduling discipline. EDF is known to be an optimal scheduling discipline when providing delay bounds to a number of calls being served by a single scheduler. We present the algorithm for call admission control (CAC), and propose a number of resource division policies used for mapping the end-to-end delay requirement of a call into local delay deadlines to be reserved at each scheduler.
منابع مشابه
Performance Evaluation of Resource Reservation Policies for Rate-Controlled Eealiest-Deadline-First Scheduling in ATM Networks*
The paper addresses the issue of reserving resources at ATM switches along the path of calls requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing cells using the Rate Controlled EarliestDeadline-First (EDF) scheduling discipline. EDF is known to be an optimal scheduling discipline when providing delay bounds to a number of calls being served by a si...
متن کاملA Finite Buffer Scheduling Scheme with Statistical Guarantee for Vbr Traffic in Atm Networks
Future ATM networks will support real-time voice and video services and we need to guarantee cell transfer delay and cell loss probability to launch such services. The Earliest Deadline First (EDF) scheme is a suitable service scheduling scheme for these services since it has been proven that it can minimize the number of late cells by assigning deadlines to the cells. However, the EDF scheme c...
متن کاملEvaluation of Resource Reservation Policies for Deterministic Services in Multi-Service Packet Networks
We address the issue of reserving resources at packet switches along the path of connections requiring a deterministic end-to-end delay bound. The switches are assumed to schedule outgoing packets using either the Packet-by-Packet Generalized Processor Sharing (PGPS) or the Rate-Controlled Earliest-Deadline First (RC-EDF) scheduling disciplines. We propose a set of resource reservation policies...
متن کاملPerformance Evaluation of Resource Reservation Policies for Rate-Controlled Earliest-Deadline-First Scheduling in Multi-Service Packet Networks
The paper addresses the issue of reserving resources at packet switches along the path of flows requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing packets using the RateControlled Earliest-Deadline-First (RC-EDF) scheduling discipline. EDF is known to be an optimal scheduling discipline for deterministic delay services in the single scheduler case...
متن کاملM1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)
In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...
متن کامل